/**
 *
 * <p>Scheduling problem.</p>
 *
 * <p>There are many scheduling problems. Many of them are NP-hard. Some of the popular ones are makespan problem, interval scheduling problem, etc.</p>
 *
 * <h3>Maximum size of compatible set of jobs.</h3>
 *
 *
 *
 *
 *
 *
 *
 * @author Trung Phan
 *
 */
package net.tp.algo.scheduling;